Extrapolation techniques for ill-conditioned linear systems
نویسندگان
چکیده
In this paper, the regularized solutions of an ill{conditioned system of linear equations are computed for several values of the regularization parameter. Then, these solutions are extrapolated at = 0 by various vector rational extrapolations techniques built for that purpose. These techniques are justiied by an analysis of the regularized solutions based on the singular value decomposition and the generalized singular value decomposition. Numerical results illustrate the eeectiveness of the procedures.
منابع مشابه
Solving linear equations on parallel distributed memory architectures by extrapolation
Extrapolation methods can be used to accelerate the convergence of vector sequences. It is shown how three di erent extrapolation algorithms, the minimal polynomial extrapolation (MPE), the reduced rank extrapolation (RRE) and the modi ed minimal polynomial extrapolation (MMPE), can be used to solve systems of linear equations. The algorithms are derived and equivalence to di erent Krylov subsp...
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملMulti-Level Approach to Numerical Solution of Inverse Problems
Mathematical modeling of an engineering system often leads to such formulations for which one can not obtain a closed form solution/analysis, and thus numerical methods are to be used. In the process, we need to transform the system from an infinite dimensional space to a finite dimensional one(discretization). The result is usually a system of linear equations[5] for which the linear least squ...
متن کاملDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملImproving the Solvability of Ill-conditioned Systems of Linear Equations by Reducing the Condition Number of Their Matrices
This paper is concerned with the solution of ill-conditioned Systems of Linear Equations (SLE’s) via the solution of equivalent SLE’s which are well-conditioned. A matrix is first constructed from that of the given ill-conditioned system. Then, an adequate right-hand side is computed to make up the instance of an equivalent system. Formulae and algorithms for computing an instance of this equiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 81 شماره
صفحات -
تاریخ انتشار 1998